Performance Study of a Parallel Shortest PathAlgorithmMichelle
نویسندگان
چکیده
Traac equilibrium analyses are generally very large and computationally intensive. Parallel processing provides the memory and computational power needed to solve the equilibrium problems in a reasonable amount of time. Because the shortest path solution is the major component of these equilibrium algorithms, we focus on developing an eecient parallel algorithm to solve this problem. We investigate in detail how three factors{computation, communication and idle time{aaect the performance of these algorithms. This analysis leads to methods of reducing the total execution time of a parallel shortest path algorithm.
منابع مشابه
An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs using the ∆-stepping parallel algorithm. We report performance results on the Cray MTA-2, a multithreaded parallel computer. The MTA-2 is a high-end shared memory system offering two unique features that aid the efficient parallel implementation of irregular al...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملPerformance Study of Parallel Shortest Path Algorithms: Characteristics of Good Decompositions
Shortest path algorithms are a key component of many applications such as VLSI and transportation algorithms. The solution for shortest paths is very computationally intensive; therefore, using parallel processing is advantageous. The performance of parallel shortest path depends on how the data is partitioned among the processors. In this paper, we investigate how the decomposition aaects perf...
متن کاملParallel implementation of geometric shortest path algorithms
In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics however increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel imp...
متن کاملEffect of Buildings around Highways on the Efficiency of T-Shaped Parallel Acoustic Barriers: A Theoretical Study
Introduction: Over recent years, various programs have been conducted to reduce noise, indicating the increasing concerns of society over noise pollution. This study has been performed to enhance the performance of parallel barriers on two sides of a highway considering the surrounding buildings. Material and Methods: The 2D boundary element simulation method was employed to predict the noise ...
متن کامل